An efficient conjugate directions method without linear minimization
نویسندگان
چکیده
منابع مشابه
Generation of Conjugate Directions for Unconstrained Minimization without Derivatives
We analyze a technique for unconstrained minimization without derivatives. This stems from two theorems proved by M. J. D. Powell. A particular version, which we consider in detail, is related to the Jacobi process for finding the eigensystem of a symmetric matrix, and the two processes, although different, help to illuminate one another. We study convergence of the search directions to mutual ...
متن کاملA modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea
A modification of the limited-memory variable metric BNS method for large scale unconstrained optimization is proposed, which consist in corrections (derived from the idea of conjugate directions) of the used difference vectors for better satisfaction of previous quasiNewton conditions. In comparison with [16], where a similar approach is used, correction vectors from more previous iterations c...
متن کاملAn Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata
A classical construction of Aho and Corasick solves the pattern matching problem for a finite set of words X in linear time, where the size of the input X is the sum of the lengths of its elements. It produces an automaton that recognizes A∗X, where A is a finite alphabet, but which is generally not minimal. As an alternative to classical minimization algorithms, which yields a O(n logn) soluti...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملA Preconditioned Conjugate Gradient Approach to Linear Equality Constrained Minimization
We propose a new framework for the application of preconditioned conjugate gradients in the solution of large-scale linear equality constrained minimization problems. This framework allows for the exploitation of structure and sparsity in the context of solving the reduced Newton system (despite the fact that the reduced system may be dense).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nuclear Instruments and Methods in Physics Research Section A: Accelerators, Spectrometers, Detectors and Associated Equipment
سال: 2000
ISSN: 0168-9002
DOI: 10.1016/s0168-9002(00)00568-4